VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures
نویسندگان
چکیده
This paper presents VLSI/WSI designs for a recently introduced parallel architecture known as the folded cube-connected cycles ( F C C C ) . We first discuss two layouts for the FCCC, in which there is no component redundancy. Then we incorporate redundancy, and present locally and globally reconfigurable FCCCs. We also discuss the design of universal building blocks for the construction of fault-tolerant FCCCs of various dimensions.
منابع مشابه
Yield Enhancement Architecture of WSI Cube-Connected Cycle
The current state of the art in VLSI technology has stimulated research in parallel computers which satisfy the continues increasing demand for computing power in the fields of advanced science and technology. The cube-connected cycle (CCC) is one of the most attractive interconnections and architectures for parallel computers. This paper addresses a new yield enhancement architecture of the cu...
متن کاملYield Enhancement Designs for Wsi Cube Connected Cycles
In this paper, we present and analyze yield enhancement designs for wafer scale Cube Connected Cycles (CCC). Improvements in yield can be achieved through silicon area reduction and/or through the incorporation of defect/fault tolerance into the architecture. Consequently, we first propose a new compact layout strategy for CCC. We then present a novel implementation of wafer scale CCC based on ...
متن کاملMultilayer VLSI Layout for Interconnection Networks
Current VLSI technology allows more than two wiring layers and the number is expected to rise in future. In this paper, we show that, by designing VLSI layouts directly for an L-layer model, the layout area for a variety of networks can be reduced by a factor of about L 2 2 compared to the layout area required under a 2-layer model, and the volume and maximum wire length can be reduced by a fac...
متن کاملEfficient VLSI Layouts of Hypercubic Networks
In this paper, we present efficient VLSI layouts of several hypercubic networks. We show that an N-node hypercube and an N-node cube-connected cycles (CCC) graph can be laid out in 4N2=9 + o(N2) and 4N2=(9log22 N) + o(N2= log2 N) areas, respectively, both of which are optimal within a factor of 1:7̄+ o(1). We introduce the multilayer grid model, and present efficient layouts of hypercubes that u...
متن کاملHYPERCUBE Vs CUBE-CONNECTED CYCLES: A TOPOLOGICAL EVALUATION
Hypercubes and cube-connected cycles differ in the number of links per node which has fundamental implications on several issues including performance and ease of implementation. In this paper, we evaluate these networks with respect to a number of parameters including several topological characterizations, fault-tolerance, various broadcast and point-to-point communication primitives. In the p...
متن کامل